Interest Points via Maximal Self-Dissimilarities
نویسندگان
چکیده
We propose a novel interest point detector stemming from the intuition that image patches which are highly dissimilar over a relatively large extent of their surroundings hold the property of being repeatable and distinctive. This concept of contextual self-dissimilarity reverses the key paradigm of recent successful techniques such as the Local Self-Similarity descriptor and the Non-Local Means filter, which build upon the presence of similar rather than dissimilar patches. Moreover, our approach extends to contextual information the local selfdissimilarity notion embedded in established detectors of corner-like interest points, thereby achieving enhanced repeatability, distinctiveness and localization accuracy.
منابع مشابه
Common Zero Points of Two Finite Families of Maximal Monotone Operators via Proximal Point Algorithms
In this work, it is presented iterative schemes for achieving to common points of the solutions set of the system of generalized mixed equilibrium problems, solutions set of the variational inequality for an inverse-strongly monotone operator, common fixed points set of two infinite sequences of relatively nonexpansive mappings and common zero points set of two finite sequences of maximal monot...
متن کاملData Error Reduction in Nonmetric Multidimensional Scaling
The aim of Multidimensional Scaling (MDS) is to search for a geometrical pattern of n points, on the basis of experimental dissimilarities data between these points. For nonmetric MDS, one may use ordinal data as dissimilarities. In general, as these dissimilarities are empirical, they may be errorful. Thus, in order to obtain better scaling solutions, it is of great interest to reduce error in...
متن کاملFinding Exemplars from Pairwise Dissimilarities via Simultaneous Sparse Recovery
Given pairwise dissimilarities between data points, we consider the problem of finding a subset of data points, called representatives or exemplars, that can efficiently describe the data collection. We formulate the problem as a row-sparsity regularized trace minimization problem that can be solved efficiently using convex programming. The solution of the proposed optimization program finds th...
متن کاملCodon Distribution in Error-Detecting Circular Codes.
In 1957, Francis Crick et al. suggested an ingenious explanation for the process of frame maintenance. The idea was based on the notion of comma-free codes. Although Crick's hypothesis proved to be wrong, in 1996, Arquès and Michel discovered the existence of a weaker version of such codes in eukaryote and prokaryote genomes, namely the so-called circular codes. Since then, circular code theory...
متن کاملFrom dissimilarities among species to dissimilarities among communities: a double principal coordinate analysis.
This paper presents a new ordination method to compare several communities containing species that differ according to their taxonomic, morphological or biological features. The objective is first to find dissimilarities among communities from the knowledge about differences among their species, and second to describe these dissimilarities with regard to the feature diversity within communities...
متن کامل